The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Keyword auctions are being used to sell the positions along the side of organic results shown by search engine when user types a keyword or a query related to keyword in a search engine. It has been a huge revenue generating arena for search engines since last decade. Irrespective of the great success of these types
KSORD (keyword search over relational database) techniques allow users to obtain information from databases, which is just like using search engines. However, the advanced techniques only realize exact queries, but not for fuzzy queries. The Rocchio algorithm of learning classification is introduced which is made a
TASTIER is a research project on the new information-access paradigm called type-ahead search, in which systems find answers to a keyword query on-the-fly as users type in the query. In this paper we study how to support fuzzy type-ahead search in TASTIER. Supporting fuzzy search is important when users have limited
based on keyword indexing, there are many records in their result lists that are irrelevant to the user's information needs. It is shown that for retrieving more relevant and precise results, the following two points should be concerned: First of all, the query (either it is generated by a human or an intelligent agent
matching contexts-dependent keywords and concepts. In the CFS model, a word exact meaning may be determined by other words in contexts. Due to the fact that numerous combinations of words may appear in queries and documents, it may be difficult to define the relations between concepts in all possible combinations. To solve
the most relevant facts for a query. If deduction results yield low confidence factor, standard search engine provides a baseline response (relevant paragraphs based on keyword matches). Our design principles aim for flexible, domain independent capability and minimize human input to provision of semantic clues and
The Fuzzy-Go search engine develops a fuzzy ontology to capture the similarities of terms in the ontology for accomplishing the semantic search of keywords, a web crawler to gather and classify web pages, and a fuzzy search mechanism to aggregate all fuzzy factors based on their degrees of importance and degrees of
As an approach to search /retrieve such objects as pictures, music, perfumes and apparels on the Internet, sensitivity-vectors or kansei-vectors are useful since textual keywords are not sufficient to find objects that users want. The sensitivity-vector is an array of values each indicates a degree of feeling or
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.